Chern and Pontryagin Numbers in Perfect Symmetries of Spheres

The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery.     

GLOBAL ATTRACTOR OF A SPATIALLY DISCRETIZED REACTION-DIFFUSION SYSTEM WITH HAMILTONIAN STRUCTURE

１ＨａｍｉｌｔｏｎｉａｎＳｔｒｕｃｔｕｒｅｉｎＲｅａｃｔｉｏｎ－ＤｉｆｕｓｉｏｎｓｙｓｔｅｍＣｏｎｓｉｄｅｒａｓｙｓｔｅｍｏｆｒｅａｃｔｉｏｎ－ｄｉｆｕｓｉｏｎｅｑｕａｔｉｏｎｓｕｔ＝ｕｘｘ＋ｆ（ｕ，ｖ）ｖｔ＝ｖｘｘ＋ｇ（ｕ，ｖ）｛（１．１）ｗｈｅｒ...     

非线性控制系统的最小实现

对于那些由代数微分方程描述的具有输入输出关系的非线性控制系统，本文采用两种方法讨论了其最小实现问题：一种方法是直接计算系统的特征列；另一种方法则采用了本原元定理．两种方法给出的最小实现所需的状态变量最小数目是相等的．文中的大量代数与微分运算则可利用数学机械化来完成     

A Fixed Point Theorem for Multi—valued Composite Increasing Operators

Ａ　Ｆｉｘｅｄ　Ｐｏｉｎｔ　Ｔｈｅｏｒｅｍ　ｆｏｒ　Ｍｕｌｔｉ－ｖａｌｕｅｄ　Ｃｏｍｐｏｓｉｔｅ　Ｉｎｃｒｅａｓｉｎｇ　ＯｐｅｒａｔｏｒｓＬｉＦｅｎｇｙｏｕ（李凤友）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｔｉａｎｊｉｎ＇ＮｏｒｍａｌＵｎｉ...     

广义集值强非线性拟变分不等式

本文引入并研究一类新的广义集值强非线性拟变分不等式,讨论这类广义集值强非线性拟变分不等式解的存在性以及由算法所构造的迭代序列的收敛性.我们的结果改进和发展了Noor,Siddiqi和Ansari等人近期的一些主要结果.     

Sets of sampling and interpolation in Bergman spaces

Properties of the unions of sampling and interpolation sets for Bergman spaces are discussed in conjunction with the examples given by Seip (1993). Their relationship to the classical interpolation sequences is explored. In addition, the role played by canonical divisors in the study of these sets is examined and an example of a sampling set is constructed in the disk.

     

最大无关组的判定定理及其它

本文给出了一个判定最大无关组的充要性定理及其证明．同时对用矩阵的行变换求最大无关组这一问题进行了点滴分析并介绍了一个解齐次线性方程组的简便方法。     

Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法

主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集．在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点．同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果．     

Orders of Indescribable Sets

We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.     

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .